On self-dual bases of the extensions of the binary fieldHIRVENSALO, Mika; LAHTONEN, Jyrki.Theory is forever : essays dedicated to Arto Salomaa on the occasion of this 70th birthday. Lecture notes in computer science. 2004, pp 102-111, issn 0302-9743, isbn 3-540-22393-2, 10 p.Book Chapter

On all-substrings alignment problemsWEI FU; HON, Wing-Kai; SUNG, Wing-Kin et al.Lecture notes in computer science. 2003, pp 80-89, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

A method for improving string pattern matching machinesAOE, J.-I; YAMAMOTO, Y; SHIMADA, R et al.Systems, computers, controls. 1982, Vol 13, Num 4, pp 71-82, issn 0096-8765Article

On the size of DASG for multiple textsCROCHEMORE, Maxime; TRONICEK, Zdenek.Lecture notes in computer science. 2002, pp 58-64, issn 0302-9743, isbn 3-540-44158-1, 7 p.Conference Paper

The size of subsequence automatonTRONICEK, Zdenek; SHINOHARA, Ayumi.Lecture notes in computer science. 2003, pp 304-310, issn 0302-9743, isbn 3-540-20177-7, 7 p.Conference Paper

On the length of the minimum solution of word equations in one variableBABA, Kensuke; TSURUTA, Satoshi; SHINOHARA, Ayumi et al.Lecture notes in computer science. 2003, pp 189-197, issn 0302-9743, isbn 3-540-40671-9, 9 p.Conference Paper

Linear time algorithm for the longest common repeat problemLEER, Inbok; ILIOPOULOS, Costas S; PARK, Kunsoo et al.Lecture notes in computer science. 2004, pp 10-17, issn 0302-9743, isbn 3-540-23210-9, 8 p.Conference Paper

Two-pattern stringsFRANEK, Frantisek; JIANDONG JIANG; WEILIN LU et al.Lecture notes in computer science. 2002, pp 76-84, issn 0302-9743, isbn 3-540-43862-9, 9 p.Conference Paper

Compression of character strings by an adaptive dictionaryJAKOBSSON, M.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 4, pp 593-603, issn 0006-3835Article

Computing the λ-seeds of a stringQING GUO; HUI ZHANG; ILIOPOULOS, Costas S et al.Lecture notes in computer science. 2006, pp 303-313, issn 0302-9743, isbn 3-540-35157-4, 1Vol, 11 p.Conference Paper

Finding cross-lingual spelling variantsLINDEN, Krister.Lecture notes in computer science. 2004, pp 136-137, issn 0302-9743, isbn 3-540-23210-9, 2 p.Conference Paper

Common subsequence automatonTRONICEK, Zdenek.Lecture notes in computer science. 2003, pp 270-275, issn 0302-9743, isbn 3-540-40391-4, 6 p.Conference Paper

Detecting leftmost maximal periodicitiesMAIN, M. G.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 145-153, issn 0166-218X, 9 p.Article

Présentation du langage Icon = Icon language introductionLECARME, O.TSI. Technique et science informatiques. 1988, Vol 7, Num 3, pp 295-307, issn 0752-4072Article

Ein Assoziativspeicher für String- und Feldverarbeitung = Mémoire associative pour le traitement de champs et de chaînes de caractères = Associative memory for the strings and field processingWOLF, G.Siemens Forschungs- und Entwicklungsberichte. 1987, Vol 16, Num 2, pp 60-65, issn 0370-9736Article

Non-approximability of the randomness deficiency functionUSTINOV, Michael A.Lecture notes in computer science. 2006, pp 364-368, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 5 p.Conference Paper

SPIRE 2004 : string processing and information retrieval (Padova, 5-8 October 2004)Apostolico, Alberto; Melucci, Massimo.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23210-9, XIV, 332 p, isbn 3-540-23210-9Conference Proceedings

Toward optimal motif enumerationEVANSL, Patricia A; SMITH, Andrew D.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

Merkle puzzles revisited - finding matching elements between lists. DiscussionCHRISTIANSON, Bruce; WHEELER, David; KUHN, Markus et al.Lecture notes in computer science. 2002, pp 87-94, issn 0302-9743, isbn 3-540-44263-4, 8 p.Conference Paper

One-gapped q-gram filters for Levenshtein distanceBURKHARDT, Stefan; KÄRKKÄINEN, Juha.Lecture notes in computer science. 2002, pp 225-234, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

A compressive code of partial wordCHANGE JIN.International symposium on computerized information retrieval. 2. 1987, pp 168-172Conference Paper

An investigation of different string coding methodsGOYAL, P.Journal of the American Society for Information Science. 1984, Vol 35, Num 4, pp 248-252, issn 0002-8231Article

Tolerant software for the recognition of user-defined commands in a data-base environmentMORRISON, P. R; NOBLE, G.Behaviour & information technology (Print). 1984, Vol 3, Num 1, pp 3-12, issn 0144-929XArticle

String processing and information retrieval (13th International conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006)Crestani, Fabio; Ferragina, Paolo; Sanderson, Mark et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-45774-7, 1Vol, XIV-366 p, isbn 3-540-45774-7Conference Proceedings

String processing and information retrieval (12th international conference, SPIRE 2005)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29740-5, 1Vol, IX-406 p, isbn 3-540-29740-5Conference Proceedings